Stringology algorithms

Randomization in Parallel Stringology

In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching falls into two categories: standard stringology and nonstandard stringology. Standard Stringology concerns the study of various exact matching problems. The fundamental problem here is the basic string matching problem ...

Correctness-by-Construction in Stringology

Correctness-by-construction (CbC) is an algorithm derivation technique in which the algorithm is co-developed with its correctness proof. Starting with a specification (most often as a preand post-condition), ‘derivation steps’ are made towards a final algorithm. Critically, each step in the derivation is a correctness-preserving one, meaning that the composition of the derivation steps is the ...

A Formal Framework for Stringology

A new formal framework for Stringology is proposed, which consists of a three-sorted logical theory S designed to capture the combinatorial reasoning about finite words. A witnessing theorem is proven which demonstrates how to extract algorithms for constructing strings from their proofs of existence. Various other applications of the theory are shown. The long term goal of this line of researc...

The finite automata approaches in stringology

Advances in stringology and applications : from combinatorics via genomic analysis to computational linguistics

Written text is considered as one of the oldest methods to represent knowledge. A text can be defined as a logical and consistent sequence of symbols which encodes information in a certain language. A straightforward example are natural languages, which are typically used by humans to communicate in spoken or written form. Other underlying examples are DNA, RNA and proteins sequences; DNA and R...